#include <bits/stdc++.h>
using namespace std;
#define N 100005
typedef long long ll;
ll n;
ll a[N];
ll ans;
priority_queue<ll> q;
int main()
{
    freopen("duel.in", "r", stdin);
    freopen("duel.out","w",stdout);
    scanf("%lld", &n);
    for (int i = 1; i <= n; i++)
        scanf("%lld", a + i);
    sort(a + 1, a + 1 + n);
    for (int i = 1; i <= n; i++)
    {
        if (!q.empty() && -q.top() < a[i])
            q.pop(), ans++;
        q.push(-a[i]);
    }
    printf("%lld", n - ans);
    return 0;
}
